Analysis of Pareto-Type/M/s/c finite buffer queues
نویسنده
چکیده
The finding that Pareto distributions are adequate to model Internet packet interarrival times has motivated the proposal of methods to compute steady-state performance measures of Pareto/M/·/· queues. In this work we give an overview of some of these methods and compare them with an approach we have recently proposed, which combines embedding, uniformization and stochastic ordering techniques and is suited to solve queues with Generalized-Pareto interarrival time distributions.
منابع مشابه
ANALYSIS OF PARETO/M/s/c QUEUES USING UNIFORMIZATION
Abstract– Uniformization is a powerful numerical technique for the analysis of continuous time Markov chains that possesses a probabilistic interpretation. In this paper, we propose the combination of the embedded Markov chain approach for queues with uniformization to analyze GI/M/s/c queues. The main steps of the procedure are: (1) To compute the mixed-Poisson probabilities associated to the ...
متن کاملInfinite- and Finite-buffer Markov Fluid Queues: a Unified Analysis
In this paper, we study Markov fluid queues where the net fluid rate to a single-buffer system varies with respect to the state of an underlying continuous-time Markov chain. We present a novel algorithmic approach to solve numerically for the steady-state solution of such queues. Using this approach, both infiniteand finite-buffer cases are studied. We show that the solution of the infinite-bu...
متن کاملAnalysis and Approximation of Dual Tandem Queues with Finite Buffer Capacity
Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from Friedman's reduction method. Fundamental properties of tandem queues with finite buffer capacity are examined. We show that in general system service rate of a dual tan...
متن کاملA Unified Method of Analysis for Queues with Markovian Arrivals
We deal with finite-buffer queueing systems fed by a Markovian point process. This class includes the queues of type M/G/1/N, M/G/1/N, PH/G/1/N, MMPP/G/1/N, MAP/G/1/N, and BMAP/G/1/N and is commonly used in the performance evaluation of network traffic buffering processes. Typically, such queueing systems are studied in the stationary regime using matrixanalytic methods connected with M/G/1-typ...
متن کاملComparison of two approximations for the loss probability in finite-buffer queues
This note deals with two related approximations that were recently proposed for the loss probability in finite-buffer queues. The purpose of the paper is two-fold. First, to provide better insight and more theoretical support for both approximations. Second, to show by an experimental study how well both approximations perform. An interesting empirical finding is that in many cases of practical...
متن کامل